Quick simulations of networks of GI/GI/1 queues
نویسندگان
چکیده
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملInference and Learning in Networks of Queues
Probabilistic models of the performance of computer systems are useful both for predicting system performance in new conditions, and for diagnosing past performance problems. The most popular performance models are networks of queues. However, no current methods exist for parameter estimation or inference in networks of queues with missing data. In this paper, we present a novel viewpoint that ...
متن کاملHow Networks of Queues Came About
T essay, about work done almost a half century ago, is written as a snippet of autobiography rather than as a technical review of the mathematics of networks of queues. To summarize, interest in jobshop manufacturing led me to a good mathematical subject area. I tried the only technique I knew that seemed applicable to one of the more obvious problems in this area; surprisingly, this technique ...
متن کاملOptimal control of queues in computer networks
The design of rate allocation and queue length control in computer networks is treated as a stochastic optimal control problem. The performance index is chosen to achieve the twin objectives of minimising queue length fluctuations and fully utilising the available bandwidth. Simple, practically realisable optimal control schemes are obtained for both LANs and WANs. An adaptive scheme is propose...
متن کاملBicriteria shortest path in networks of queues
In this paper, I propose a new methodology to find the bicriteria shortest path from the source to the sink node of a network of queues under the steady-state condition. I assume the number of servers in each service station settled in a node of the network is either one or infinity. Moreover, the arc lengths are mutually independent random variables. First, I propose a method to transform each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1987
ISSN: 0304-4149
DOI: 10.1016/0304-4149(87)90072-x